On dense strongly Z2s-1-connected graphs
نویسندگان
چکیده
Let G be a graph and s > 0 be an integer. If, for any function b : V (G) → Z2s+1 satisfying v∈V (G) b(v) ≡ 0 (mod 2s+1), G always has an orientation D such that the net outdegree at every vertex v is congruent to b(v)mod 2s+1, then G is strongly Z2s+1-connected. For a graph G, denote by α(G) the cardinality of a maximum independent set of G. In this paper, we prove that for any integers s, t > 0 and real numbers a, bwith 0 < a < 1, there exist an integer N(a, b, s) and a finite family Y(a, b, s, t) of non-strongly Z2s+1-connected graphs such that for any connected simple graph G with order n ≥ N(a, b, s) and α(G) ≤ t , if G satisfies one of the following conditions: (i) for any edge uv ∈ E(G), max{dG(u), dG(v)} ≥ an + b, or (ii) for any u, v ∈ V (G) with distG(u, v) = 2, max{dG(u), dG(v)} ≥ an + b, then G is strongly Z2s+1-connected if and only if G is not contractible to a member in the finite family Y(a, b, s, t). © 2015 Elsevier B.V. All rights reserved.
منابع مشابه
On Mod (2s+1)-Orientations of Graphs
An orientation of a graph G is a mod (2p+1)-orientation if, under this orientation, the net out-degree at every vertex is congruent to zero mod 2p+1. If, for any function b : V (G) → Z2p+1 satisfying ∑ v∈V (G) b(v) ≡ 0 (mod 2p + 1), G always has an orientation D such that the net outdegree at every vertex v is congruent to b(v) mod 2p + 1, then G is strongly Z2p+1-connected. The graph G′ obtain...
متن کاملAuthor's Personal Copy Discrete Applied Mathematics on Strongly Z 2s+1 -connected Graphs
An orientation of a graph G is a mod(2s + 1)-orientation if under this orientation, the net out-degree at every vertex is congruent to zero mod(2s + 1). If for any function b : V (G) → Z2s+1 satisfying v∈V (G) b(v) ≡ 0 (mod 2s + 1), G always has an orientation D such that the net out-degree at every vertex v is congruent to b(v) mod (2s + 1), then G is strongly Z2s+1-connected. In this paper,...
متن کاملSparse highly connected spanning subgraphs in dense directed graphs
Mader (1985) proved that every strongly $k$-connected $n$-vertex digraph contains a strongly $k$-connected spanning subgraph with at most $2kn - 2k^2$ edges, and this is sharp. For dense strongly $k$-connected digraphs, the bound can be significantly improved for dense strongly $k$-connected digraphs. Let $\overline{\Delta}(D)$ be the maximum degree of the complement of the underlying undirecte...
متن کاملDistance-based topological indices of tensor product of graphs
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
متن کاملOn strongly dense submodules
The submodules with the property of the title ( a submodule $N$ of an $R$-module $M$ is called strongly dense in $M$, denoted by $Nleq_{sd}M$, if for any index set $I$, $prod _{I}Nleq_{d}prod _{I}M$) are introduced and fully investigated. It is shown that for each submodule $N$ of $M$ there exists the smallest subset $D'subseteq M$ such that $N+D'$ is a strongly dense submodule of $M$ and $D'bi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 339 شماره
صفحات -
تاریخ انتشار 2016